Partition Parameters for Girth Maximum (m, r) BTUs
نویسندگان
چکیده
This paper describes the calculation of the optimal partition parameters such that the girth maximum (m, r) Balanced Tanner Unit lies in family of BTUs specified by them using a series of proved results and thus creates a framework for specifying a search problem for finding the girth maximum (m, r) BTU. Several open questions for girth maximum (m, r) BTU have been raised.
منابع مشابه
Analysis Of The Girth For Regular Bi-partite Graphs With Degree 3
The goal of this paper is to derive the detailed description of the Enumeration Based Search Algorithm from the high level description provided in [16], analyze the experimental results from our implementation of the Enumeration Based Search Algorithm for finding a regular bi-partite graph of degree 3, and compare it with known results from the available literature. We show that the values of m...
متن کاملEnumeration Based Search Algorithm For Finding A Regular Bi-partite Graph Of Maximum Attainable Girth For Specified Degree And Number Of Vertices
We introduce a search problem for finding a regular bi-partite graph of maximum attainable girth for specified degree and number of vertices, by restricting the search space using a series of mathematically rigourous arguments from [1] and [2]. The goal of this paper is to derive the enumeration search algorithm for finding a girth maximum (m, r) BTU, which is notation for regular partite graph...
متن کاملCovering planar graphs with degree bounded forests
We prove that every planar graphs has an edge partition into three forests, one having maximum degree 4. This answers a conjecture of Balogh et al. (J. Combin. Theory B. 94 (2005) 147-158).We also prove that every planar graphs with girth g ≥ 6 (resp. g ≥ 7) has an edge partition into two forests, one having maximum degree 4 (resp. 2).
متن کاملMaximum cuts and judicious partitions in graphs without short cycles
We consider the bipartite cut and the judicious partition problems in graphs of girth at least 4. For the bipartite cut problem we show that every graph G with m edges, whose shortest cycle has length at least rX4; has a bipartite subgraph with at least m 2 þ cðrÞm r rþ1 edges. The order of the error term in this result is shown to be optimal for r 1⁄4 5 thus settling a special case of a conjec...
متن کاملCounting without sampling: Asymptotics of the log-partition function for certain statistical physics models
In this article we propose new methods for computing the asymptotic value for the logarithm of the partition function (free energy) for certain statistical physics models on certain type of finite graphs, as the size of the underlying graph goes to infinity. The two models considered are the hard-core (independent set) model when the activity parameter λ is small, and also the Potts (q-coloring...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1212.6883 شماره
صفحات -
تاریخ انتشار 2012